Covering Algorithms, Continuum Percolation and the Geometry of Wireless Networks

Continuum percolation models where each point of a two-dimensional Poisson point process is the center of a disc of given (or random) radius r, have been extensively studied. In this paper, we consider the generalization in which a deterministic algorithm (given the points of the point process) places the discs on the plane, in such a way that 1 each disc covers at least one point of the point process and that each point is covered by at least one disc. This gives a model for wireless communication networks, which was the original motivation to study this class of problems. We look at the percolation properties of this generalized model, showing the almost sure non-existence of an unbounded connected component of discs for small values of of the density of the Pois-son point process, for any covering algorithm. In general, it turns out not to be true that unbounded connected components arise when is taken suuciently high. However, we identify some large families of covering algorithms, for which such an unbounded component does arise for large values of. We show how a simple scaling operation can change the percolation properties of the model, leading to the almost sure existence of an unbounded connected component for large values of , for any covering algorithm. Finally, we show that a large class of covering algorithms, that arise in many practical applications, can get arbitrarily close to achieving a minimal density of covering discs. We also show (constructively) the existence of algorithms that achieve this minimal density.